全文获取类型
收费全文 | 68316篇 |
免费 | 10135篇 |
国内免费 | 5821篇 |
专业分类
电工技术 | 8692篇 |
技术理论 | 5篇 |
综合类 | 7038篇 |
化学工业 | 5391篇 |
金属工艺 | 2290篇 |
机械仪表 | 6541篇 |
建筑科学 | 2992篇 |
矿业工程 | 2171篇 |
能源动力 | 3164篇 |
轻工业 | 3350篇 |
水利工程 | 1658篇 |
石油天然气 | 2712篇 |
武器工业 | 910篇 |
无线电 | 6108篇 |
一般工业技术 | 5611篇 |
冶金工业 | 1829篇 |
原子能技术 | 353篇 |
自动化技术 | 23457篇 |
出版年
2024年 | 259篇 |
2023年 | 1480篇 |
2022年 | 2630篇 |
2021年 | 2813篇 |
2020年 | 3065篇 |
2019年 | 2696篇 |
2018年 | 2372篇 |
2017年 | 2905篇 |
2016年 | 3239篇 |
2015年 | 3642篇 |
2014年 | 5197篇 |
2013年 | 5048篇 |
2012年 | 5701篇 |
2011年 | 5834篇 |
2010年 | 4068篇 |
2009年 | 4373篇 |
2008年 | 3957篇 |
2007年 | 4418篇 |
2006年 | 3737篇 |
2005年 | 3050篇 |
2004年 | 2510篇 |
2003年 | 1986篇 |
2002年 | 1697篇 |
2001年 | 1392篇 |
2000年 | 1126篇 |
1999年 | 823篇 |
1998年 | 741篇 |
1997年 | 646篇 |
1996年 | 535篇 |
1995年 | 474篇 |
1994年 | 409篇 |
1993年 | 297篇 |
1992年 | 257篇 |
1991年 | 209篇 |
1990年 | 156篇 |
1989年 | 136篇 |
1988年 | 89篇 |
1987年 | 43篇 |
1986年 | 47篇 |
1985年 | 32篇 |
1984年 | 26篇 |
1983年 | 35篇 |
1982年 | 26篇 |
1981年 | 11篇 |
1980年 | 18篇 |
1979年 | 17篇 |
1978年 | 9篇 |
1977年 | 7篇 |
1959年 | 5篇 |
1951年 | 12篇 |
排序方式: 共有10000条查询结果,搜索用时 28 毫秒
991.
空间刚架结构采用墩梁固结的构造,在竖向荷载作用下,能够利用固结端的负弯矩降低梁的跨中弯矩,从而达到减小梁高的目的。在桥下净空受限的情况下,根据刚架结构的力学特点,进行形状优化可极大地改善线路条件,更好适应地形。结合青龙山特大桥的设计,介绍了空间刚架结构的特点及不同桥式方案的选择。采用有限元方法对选取1号节段刚架进行验算,结果表明刚架各控制点参数均满足标准要求。空间异型刚架桥方案可为线路夹角小、净空受限的桥梁工程施工设计提供有益参考。 相似文献
992.
Particle swarm optimization is a stochastic population-based algorithm based on social interaction of bird flocking or fish schooling. In this paper, a new adaptive inertia weight adjusting approach is proposed based on Bayesian techniques in PSO, which is used to set up a sound tradeoff between the exploration and exploitation characteristics. It applies the Bayesian techniques to enhance the PSO's searching ability in the exploitation of past particle positions and uses the cauchy mutation for exploring the better solution. A suite of benchmark functions are employed to test the performance of the proposed method. The results demonstrate that the new method exhibits higher accuracy and faster convergence rate than other inertia weight adjusting methods in multimodal and unimodal functions. Furthermore, to show the generalization ability of BPSO method, it is compared with other types of improved PSO algorithms, which also performs well. 相似文献
993.
Differential evolution (DE) is a simple and effective approach for solving numerical optimization problems. However, the performance of DE is sensitive to the choice of mutation and crossover strategies and their associated control parameters. Therefore, to achieve optimal performance, a time-consuming parameter tuning process is required. In DE, the use of different mutation and crossover strategies with different parameter settings can be appropriate during different stages of the evolution. Therefore, to achieve optimal performance using DE, various adaptation, self-adaptation, and ensemble techniques have been proposed. Recently, a classification-assisted DE algorithm was proposed to overcome trial and error parameter tuning and efficiently solve computationally expensive problems. In this paper, we present an evolving surrogate model-based differential evolution (ESMDE) method, wherein a surrogate model constructed based on the population members of the current generation is used to assist the DE algorithm in order to generate competitive offspring using the appropriate parameter setting during different stages of the evolution. As the population evolves over generations, the surrogate model also evolves over the iterations and better represents the basin of search by the DE algorithm. The proposed method employs a simple Kriging model to construct the surrogate. The performance of ESMDE is evaluated on a set of 17 bound-constrained problems. The performance of the proposed algorithm is compared to state-of-the-art self-adaptive DE algorithms: the classification-assisted DE algorithm, regression-assisted DE algorithm, and ranking-assisted DE algorithm. 相似文献
994.
The capture of an eye image with the occlusion of spectacles in a non-cooperative environment compromises the accuracy in identifying a person in an iris recognition system. This is due to the obstruction of the iris by the frame which tends to produce an incorrect estimation of the initial center of the iris and the pupil during the iris segmentation process. In addition, it also causes incorrect localization of the upper eyelid during the process of iris segmentation and sometimes, the edges of the frame are wrongly identified as the edges of the upper eyelid. A frame detection method which involves the combination of two gradients, namely the Sobel operator and high pass filter, followed by fuzzy logic and the dilation operation of morphological processing is proposed to identify the frame on the basis of different frame factors in the capture of a distant eye image. In addition, a different color space is applied and only a single channel is used for the process of frame detection. The proposed frame detection method provides the highest frame detection rate compared to the other methods, with a detection rate of more than 80.0%. For the accuracy of the iris localization, upper eyelid localization and iris recognition system, the proposed method gives more than 96.5% accuracy compared to the other methods. The index of decidability showed that the proposed method gives more than 2.35 index compared to the existing methods. 相似文献
995.
996.
Finding an optimal alignment connecting two end-points in a specified corridor is a complex problem that requires solving three interrelated sub-problems, namely the horizontal alignment, vertical alignment and earthwork optimization problems. In this research, we developed a novel bi-level optimization model combining those three problems. In the outer level of the model, we optimize the horizontal alignment and in the inner level of the model a vertical alignment optimization problem considering earthwork allocation is solved for a fixed horizontal alignment. Derivative-free optimization algorithms are used to solve the outer problem. The result of our model gives an optimal horizontal alignment in the form of a linear-circular curve and an optimal vertical alignment in the form of a quadratic spline. Our model is tested on real-life data. The numerical results show that our approach improves the road alignment designed by civil engineers by 27% on average, resulting in potentially millions of dollars of savings. 相似文献
997.
The multi-objective economic dispatch (MOED) problem in cascaded hydropower systems is a complicated nonlinear optimization problem with a group of complex constraints. In this paper, an improved partheno genetic algorithm (IPGA) for resolving the MOED problem in hydropower energy systems based on the non-uniform mutation operator is proposed. In the new algorithm, the crossover operator is removed and only mutation operation is made, which makes it simpler than GA in the genetic operations and not generate invalid offspring during evolution. With the help of incorporating greedy selection idea into the non-uniform mutation operator, IPGA searches the solution space uniformly at the early stage and very locally at the later stage, which makes it avoid the random blind jumping and stay at the promising solution areas. Finally, the proposed algorithm is applied to a realistic hydropower energy system with two giant scale cascaded hydropower plants in China. Compared with other algorithms, the results obtained using IPGA verify its superiority in both efficiency and precision. 相似文献
998.
Managing inventory and service levels in a capacitated supply chain environment with seasonal demand requires appropriate selection and readjustment of replenishment decision variables. This study focuses on the dynamic adjustment of decision variables within supply chains using continuous-review reorder point (ROP) replenishment. A framework is proposed to adjust reorder points and lot sizes based on optimal settings within different regions of a seasonal demand cycle. This framework also includes the optimal timing of adjustments defining these regions. A discrete-event simulation model of a simple, capacity-constrained supply chain is developed and simulation–optimization experiments are performed, the objective being to minimize the total supply chain inventory subject to a target delivery service level. The performance of ROP systems with optimal static and optimal dynamic decision variable settings are compared using two different seasonal demand patterns. The results confirm that performance with dynamic decision variable adjustment is better. For a given delivery service level, average work-in-process inventory levels are almost the same for both systems. However average finished goods inventory levels decrease significantly and are more stable under dynamic adjustment. The practical implication is that both finished goods holding costs and maximum storage capacity requirements are reduced. 相似文献
999.
为满足水利水电工程远程视频诊断的需求,提出一种适用于偏远山区的无线网络规划方案。介绍了网络规划中,查勘选址的原则,Mesh多频组网的覆盖方式,链路预算和仿真设备选型,以及通过调整天线高度、下倾角和方向角等手段对网络进行优化的方法。规划方案成功应用于乌东德水电站施工现场,现场骨干网络达到1.4Gbps,满足了后方对高清视频诊断的需求。相较于传统的有线网络、卫星通讯和3G通讯方式,该网络成本更低,建设便捷,更适于偏远山区。 相似文献
1000.
We investigate the Robust Multiperiod Network Design Problem, a generalization of the Capacitated Network Design Problem (CNDP) that, besides establishing flow routing and network capacity installation as in a canonical CNDP, also considers a planning horizon made up of multiple time periods and protection against fluctuations in traffic volumes. As a remedy against traffic volume uncertainty, we propose a Robust Optimization model based on Multiband Robustness (Büsing and D’Andreagiovanni, 2012), a refinement of classical Γ-Robustness by Bertsimas and Sim that uses a system of multiple deviation bands.Since the resulting optimization problem may prove very challenging even for instances of moderate size solved by a state-of-the-art optimization solver, we propose a hybrid primal heuristic that combines a randomized fixing strategy inspired by ant colony optimization and an exact large neighbourhood search. Computational experiments on a set of realistic instances from the SNDlib show that our original heuristic can run fast and produce solutions of extremely high quality associated with low optimality gaps. 相似文献